Tight extensions of distance spaces and the dual fractionality of undirected multiflow problems
نویسنده
چکیده
In this paper, we give a complete characterization of the class of weighted maximum multiflow problems whose dual polyhedra have bounded fractionality. This is a common generalization of two fundamental results of Karzanov. The first is a characterization of commodity graphs H for which the dual of maximum multiflow problem with respect to H has bounded fractionality, and the second is a characterization of metrics d on terminals for which the dual of metric-weighed maximum multiflow problem has bounded fractionality. A key ingredient of the present paper is a non-metric generalization, due to the present author, of the tight span, which was originally introduced for metrics by by Isbell, Dress, and Chrobak and Larmore. A theory of non-metric tight spans provides a unified duality framework to the weighted maximum multiflow problem, and gives a unified interpretation of combinatorial dual solutions of several known minimax theorems in the multiflow theory.
منابع مشابه
Tight spans of distances and the dual fractionality of undirected multiflow problems
In this paper, we give a complete characterization of the class of weighted maximum multiflow problems whose dual polyhedra have bounded fractionality. This is a common generalization of two fundamental results of Karzanov. The first one is a characterization of commodity graphs H for which the dual of maximum multiflow problem with respect to H has bounded fractionality, and the second one is ...
متن کاملOn fractionality of the path packing problem
Given an undirected graph G = (N,E), a subset T of its nodes and an undirected graph (T, S), G and (T, S) together are often called a network. A collection of paths in G whose end-pairs lie in S is called an integer multiflow. When these paths are allowed to have fractional weight, under the constraint that the total weight of the paths traversing a single edge does not exceed 1, we have a frac...
متن کاملBounded fractionality of the multiflow feasibility problem for demand graph K3+K3 and related maximization problems
We consider the multiflow feasibility problem whose demand graph is the vertexdisjoint union of two triangles. We show that this problem has a 1/12-integral solution whenever it is feasible and satisfies the Euler condition. This solves a conjecture raised by Karzanov, and completes the classification of the demand graphs having bounded fractionality. We reduce this problem to the multiflow max...
متن کاملHalf-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
In this paper, we establish a novel duality relationship between node-capacitated multiflows and tree-shaped facility locations. We prove that the maximum value of a tree-distance-weighted maximum node-capacitated multiflow problem is equal to the minimum value of the problem of locating subtrees in a tree, and the maximum is attained by a half-integral multiflow. Utilizing this duality, we sho...
متن کاملBounded fractionality of the multiflow feasibility problem for demand graph K 3 + K 3 and related
We consider the multiflow feasibility problem whose demand graph is the vertex-disjoint union of two triangles. We show that this problem has a 1/12-integral solution or no solution under the Euler condition. This solves a conjecture raised by Karzanov, and completes the classification of the demand graphs having bounded fractionality. We reduce this problem to the multiflow maximization proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007